Coherence graphs
نویسندگان
چکیده
منابع مشابه
Coherence graphs
We consider the task of proving Walley’s (joint or strong) coherence of a number of probabilistic assessments, when these assessments are represented as a collection of conditional lower previsions. In order to maintain generality in the analysis, we assume to be given nearly no information about the numbers that make up the lower previsions in the collection. Under this condition, we investiga...
متن کاملFiniteness spaces, graphs and "coherence"
We look at a sub-collection of finiteness spaces introduced in [2] based on the notion of coherence spaces from [4]. The original idea was to generalize the notion of stable functions between coherence spaces to interpret the algebraic lambda-calculus ([6]) or even the differential lambda-calculus ([3]). An important tool for this analysis is the infinite Ramsey theorem. 0. Introduction. The ca...
متن کاملCCICheck: using µhb graphs to verify the coherence-consistency interface
In parallel systems, memory consistency models and cache coherence protocols establish the rules specifying which values will be visible to each instruction of parallel programs. Despite their central importance, verifying their correctness has remained a major challenge, due both to informal or incomplete specifications and to difficulties in scaling verification to cover their operations comp...
متن کاملConsensus in Self-similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence
The hierarchical graphs and Sierpiński graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural properties: the hierarchical graphs are non-fractal and smallworld, while the Sierpiński graphs are fractal and “large-world”. Both graphs have found broad applications. In this paper, we study consensus problems in ...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2009
ISSN: 0004-3702
DOI: 10.1016/j.artint.2008.09.001